Sean Lawton and Elisha Peterson
نویسنده
چکیده
Denote the free group on 2 letters by F2 and the SL(2,C)-representation variety of F2 by R = Hom(F2, SL(2,C)). The group SL(2,C) acts on R by conjugation. We construct an isomorphism between the coordinate ring C[SL(2,C)] and the ring of matrix coefficients, providing an additive basis of C[R]SL(2,C) in terms of spin networks. Using a graphical calculus, we determine the symmetries and multiplicative structure of this basis. This gives a canonical description of the regular functions on the SL(2,C)-character variety of F2 and a new proof of a classical result of Fricke, Klein, and Vogt.
منابع مشابه
Exact Procedures for Envy-free Chore Division
We develop the rst explicit procedures for exact envy-free chore division for 4 or more players. We also give a simple 3-person procedure. Our 4-person moving-knife scheme and n-person discrete algorithm are accomplished by exploiting a notion of \irrevocable advantage" for chores, and are motivated by similar solutions for cake-cutting by Brams, Taylor, and Zwicker. We discuss the diierences b...
متن کاملM ar 2 00 9 TRACE DIAGRAMS , MATRIX MINORS , AND DETERMINANT IDENTITIES
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function, allowing algebraic proofs to be made in the diagrammatic category. We provide a rigorous combinatorial definition of these diagrams, and prove that they may be efficiently represented in terms of matrix minors. Using this viewpoint, we provide new proofs ...
متن کاملOn a Diagrammatic Proof of the Cayley-hamilton Theorem
This note concerns a one-line diagrammatic proof of the CayleyHamilton Theorem. We discuss the proof’s implications regarding the “core truth” of the theorem, and provide a generalization. We review the notation of trace diagrams and exhibit explicit diagrammatic descriptions of the coefficients of the characteristic polynomial, which occur as the n + 1 “simplest” trace diagrams. We close with ...
متن کاملCooperation in Subset Team Games: Altruism and Selfishness
This paper extends the theory of subset team games, a generalization of cooperative game theory requiring a payoff function that is defined for all subsets of players. This subset utility is used to define both altruistic and selfish contributions of a player to the team. We investigate properties of these games, and analyze the implications of altruism and selfishness for general situations, f...
متن کامل